Differential Fault Attack on GIFT

GIFT, a lightweight block cipher proposed at CHES2017, has been widely cryptanalyzed this years. This paper studies the differential diffusion characteristics of round function GIFT first, and proposes random nibble-based fault attack. The key recovery scheme is developed on statistical properties we found for distribution table S-box. A lot experiments had done experimental results show that one can be retrieved with an average 20.24 44.96 injections GIFT-64 GIFT-128 respectively. Further analysis shows certain number recover most bits. So demonstrate improved attack combined method exhaustive search, which master recovered by performing 216 217 computations injecting 31 32 faults